Solving Symbolic Ordering Constraints
نویسنده
چکیده
Received Revised ABSTRACT We show how to solve boolean combinations of inequations s > t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable.
منابع مشابه
SMT Solving for the Theory of Ordering Constraints
Constraint solving and satisfiability checking play an important role in various tasks such as formal verification, software analysis and testing. In this paper, we identify a particular kind of constraints called ordering constraints, and study the problem of deciding satisfiability modulo such constraints. The theory of ordering constraints can be regarded as a special case of difference logi...
متن کاملOrderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)
We design combination techniques for symbolic constraint solving in the presence of associative and com-mutative (AC) function symbols. This yields an algorithm for solving AC-RPO constraints (where AC-RPO is the AC-compatible total reduction ordering of 16]), which was a missing ingredient for automated deduction strategies with AC-constraint inheritance 15, 19]. As in the AC-uniication case (...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملConstraint Solving on Terms: Syntactic Methods Preliminary lecture notes
As this has made been clear from the introductory lecture on constraints, constraints on terms (also called symbolic constraints) play a fundamental role in many if not all domains of computer science. In this lecture we are presenting the main results on symbolic constraint solving for equational unification, dis-unification and some ordering constraints. This document is in a preliminary from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 1 شماره
صفحات -
تاریخ انتشار 1990